Logic-Based Subsumption Architecture

Logic-Based Subsumption Architecture: Empirical Evaluation (Status Report)

We describe an implementation of the Logicbased Subsumption Architecture (LSA) [Amir and Maynard-Reid, 1999], an AI architecture inspired by Brooks’ subsumption architecture but based on logic. In this architecture, layers of control are axiomatized in First-Order Logic (FOL) and independent theorem provers derive each layer’s goals given its inputs. Default assumptions in the lower layers impl...

A Formalization of Interval-Based Temporal Subsumption in First Order Logic

Lambda-Subsumption and Its Application to Learning from Positive-only Examples

The general aim of the present paper is to show the advantages of the model-theoretic approach to Inductive Logic Programming. The paper introduces a new generality ordering between Horn clauses, called-subsumption. It is stronger than-subsumption and weaker than generalized subsumption. Most importantly-subsumption allows to compare clauses in a local sense, i.e. with respect to a partial inte...

Subsumption Algorithms for Concept Description Languages

We investigate subsumption algorithms for logic-based knowledge representation languages of the kl-one family. We deene an attribu-tive concept description language that contains the logical connectives conjunction, disjunction, and negation, as well as role quantiication, number restrictions and role intersection. We describe a rule based calculus to decide subsumption in this language, that c...

Generalizing Term Subsumption Languages to Fuzzy Logic

During the past decade, knowledge representation research in AI has generated a class of languages called term subsumption languages (TSL), which is a knowledge representation formalism with a well-defined logic-based semanticsDue to its formal semantics, a term subsumption system can automatically infer the subsumption relationships between concepts defined in the system. However, these system...